Resolvable balanced incomplete block designs with subdesigns of block size 4
نویسندگان
چکیده
In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v, 4, 1) RBIBDs. The problem we investigate is the existence of (v, 4, 1) RBIBDs containing a (w, 4, 1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an incomplete RBIBD, i.e., an IRB(v,w). The necessary conditions for the existence of an IRB(v,w) are that v 4w and v ≡ w ≡ 4 (mod 12). We show these conditions are sufficient with a finite number (179) of exceptions, and in particular whenever w ≡ 16 (mod 60) and whenever w 1852. We also give some results on pairwise balanced designs on v points containing (at least one) block of sizew, i.e., a (v, {K,w∗}, 1)PBD. If the list of permitted block sizes, K5, contains all integers of size 5 or more, and v,w ∈ K5, then a necessary condition on this PBD is v 4w + 1. We show this condition is not sufficient for any w 5 and give the complete spectrum (in v) for 5 w 8, as well as showing the condition v 5w is sufficient with some definite exceptions for w = 5 and 6, and some possible exceptions when w = 15, namely 77 v 79. The existence of this PBD implies the existence of an IRB(12v + 4, 12w + 4). If the list of permitted block sizes,K1(4), contains all integers ≡ 1 (mod 4), and v,w ∈ K1(4), then a necessary condition on this PBD is v 4w + 1. We show this condition is sufficient with a finite number of possible exceptions, and in particular is sufficient when w 1037. The existence of this PBD implies the existence of an IRB(3v + 1, 3w + 1). © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4
The necessary conditions for the existence of a super-simple resolvable balanced incomplete block design on v points with block size k = 4 and index λ = 2, are that v ≥ 16 and v ≡ 4 (mod 12). These conditions are shown to be sufficient. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 341–356, 2007
متن کاملOptimal resolvable designs with minimum PV aberration
Amongst resolvable incomplete block designs, affine resolvable designs are optimal in many conventional senses. However, different affine resolvable designs for the same numbers of treatments, replicates, and block size can differ in how well they estimate elementary treatment contrasts. An aberration criterion is employed to distinguish the best of the affine resolvable designs for this task. ...
متن کاملBalanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملBeautifully Ordered Balanced Incomplete Block Designs
Beautifully Ordered Balanced Incomplete Block Designs, BOBIBD(v, k, λ, k1, λ1), are defined and the proof is given to show that necessary conditions are sufficient for the existence of BOBIBD with block size k=3 and k1=2 and for k=4 and k1=2 except possibly for eleven exceptions. Existence of BOBIBDs with block size k=4 and k1=3 is demonstrated for all but one infinite family and the non-existe...
متن کاملUse of Resolvable Designs in Field and on Farm Experiments
1. Introduction Resolvable designs, though introduced in the combinatorial context, have found their utility in field experiments. The concept of resolvability is due to Bose (1942) who defined this for a balanced incomplete block (BIB) design. A BIB design is an arrangement of v treatments into b blocks such that each block contains k (< v) distinct treatments, each treatment appears in r bloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008